Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
251	Algorithmica:1-10 Algorithmica 9 1990Springer-VerlagNew York Inc. An Improved Parallel Algorithm for Integer GCD Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2011-02-28 05:21:13 Computational complexity theory Greatest common divisor Euclidean algorithm Number theory Time complexity Factorial Binary GCD algorithm Computational complexity of mathematical operations Mathematics Theoretical computer science Multiplicative functions
252	On the Complexity of Asynchronous Gossip Chryssis Georgiou Seth Gilbert Dept. of Computer Science, Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2008-08-26 04:43:06 Analysis of algorithms Fault-tolerant computer systems Consensus Gossip protocol Randomized algorithm Distributed computing Time complexity Gossip Theoretical computer science Computational complexity theory Applied mathematics
253	Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology Michael Fellows University of Newcastle, Callaghan, Australia Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 02:49:42 NP-complete problems Parameterized complexity Exponential time hypothesis Dominating set Tree decomposition Vertex cover Graph coloring Equitable coloring Clique Theoretical computer science Graph theory Mathematics
254	On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 21:09:14 NP-complete problems Exponential time hypothesis Conjunctive normal form Boolean satisfiability problem Vertex cover Set cover problem Time complexity Graph coloring Independent set Theoretical computer science Computational complexity theory Applied mathematics
255	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-10-04 12:29:59 Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory
256	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
257	Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip ∗ † Chryssis Georgiou Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:09 Analysis of algorithms Human communication Complexity classes Gossip protocol Network architecture Randomized algorithm Consensus Time complexity Distributed computing Theoretical computer science Computational complexity theory Applied mathematics
258	Distributed Computing over Communication Networks: Locality Lower Bounds Stefan Schmid @ T-Labs, 2011 Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:49 Graph coloring NP-complete problems Graph theory Algorithm Distributed computing Time complexity Edge coloring Theoretical computer science Mathematics Applied mathematics
259	The Utility of Abstaining in Binary Classification Akshay Balsubramani University of California, San Diego Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2013-12-05 17:49:40 Mathematics Analysis of algorithms Supervised learning Algorithm Online machine learning Randomized algorithm Time complexity Statistical classification Margin classifier Theoretical computer science Applied mathematics Machine learning
260	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics

UPDATE